Selection Initial modes for Belief K-modes Method
نویسندگان
چکیده
The belief K-modes method (BKM) approach is a new clustering technique handling uncertainty in the attribute values of objects in both the cluster construction task and the classification one. Like the standard version of this method, the BKM results depend on the chosen initial modes. So, one selection method of initial modes is developed, in this paper, aiming at improving the performances of the BKM approach. Experiments with several sets of real data show that by considered the developed selection initial modes method, the clustering algorithm produces more accurate results. Keywords—Clustering, Uncertainty, Belief function theory, Belief K-modes Method, Initial modes selection.
منابع مشابه
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation
Clustering accuracy of partitional clustering algorithm for categorical data depends primarily on the choice of initial data points to instigate the clustering process and hence the clustering results cannot be generated and repeated consistently. In this paper we present an approach to compute initial modes for K-mode partitional clustering algorithm to cluster categorical data sets. Here we u...
متن کاملFarthest-Point Heuristic based Initialization Methods for K-Modes Clustering
The k-modes algorithm has become a popular technique in solving categorical data clustering problems in different application domains. However, the algorithm requires random selection of initial points for the clusters. Different initial points often lead to considerable distinct clustering results. In this paper we present an experimental study on applying a farthest-point heuristic based init...
متن کاملComputing Initial points using Density Based Multiscale Data Condensation for Clustering Categorical data
The K-Modes clustering algorithm [1] has shown great promise for clustering large data sets with categorical attributes. K-Mode clustering algorithm suffers from the drawback of choosing random selection of initial points (modes) of the cluster. Different initial points leads to different cluster formations. In this paper Density-based Multiscale Data Condensation [2] approach with hamming dist...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملReliability Analysis of K-Out-Of N: G Machining Systems with Mixed Spares and Multiple Modes of Failure (TECHNICAL NOTE)
This paper deals with the transient analysis of K-out-of-N: G system consisting of Noperatingmachines. To improve system reliability, Y cold standby and S warm standbys spares areprovided to replace the failed machines. The machines are assumed to fail in multiple modes. At leastK-out-of-N machines for smooth functioning of the system. Reliability and mean time to failure areestablished in term...
متن کامل